#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, q;
    cin >> n;
    V<int> a(n + 1, 0), b(n + 1, 0);
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, n) cin >> b[i];

    mt19937_64 f(time(NULL));

    map<int, int> mp;
    set<int> sa, sb;
    V<int> p1(n + 1, 0), p2(n + 1, 0);

    FOR(i, 1, n) {
        if (!mp[a[i]]) {
            mp[a[i]] = f();
        }
        if (!mp[b[i]]) {
            mp[b[i]] = f();
        }
    }

    FOR(i, 1, n) {
        if (!sa.count(a[i])) {
            sa.insert(a[i]);
            p1[i] = p1[i - 1] ^ mp[a[i]];
        } else {
            p1[i] = p1[i - 1];
        }

        if (!sb.count(b[i])) {
            sb.insert(b[i]);
            p2[i] = p2[i - 1] ^ mp[b[i]];
        } else {
            p2[i] = p2[i - 1];
        }
    }

    cin >> q;
    while (q--) {
        int x, y;
        cin >> x >> y;
        if (p1[x] == p2[y]) {
            Yes;
        } else {
            No;
        }
    }
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}